-
1 functionally complete set
Математика: функционально полное множествоУниверсальный англо-русский словарь > functionally complete set
-
2 functionally complete set
English-Russian scientific dictionary > functionally complete set
-
3 set
1) набор; комплект- semiconductor assembly set - set of Belleville springs - set of conventional set - set of drawing instruments - set of gate patterns - set of gauge blocks - set of logical elements - set of statistical data - set of technical aids- snap set2) партия3) совокупность; множество4) установка; агрегат- desk telephone set - dial telephone set- gear set- local-battery telephone set - man-pack radio set - multi-operator welding set - sound-powered telephone set - wall telephone set5) регулировка; настройка || регулировать; настраивать6) группа; ансамбль7) класс; семейство9) схватывание || схватываться10) затвердевание || затвердевать11) крепление || закреплять12) геол. свита пород13) осадка (грунта) || оседать ( о грунте)14) радиоточка15) спорт сет16) включать, приводить в действие17) мат. множествоset closed under operation — множество, замкнутое относительно операции
- absolutely compact set - absolutely continuous set - absolutely convex set - absolutely irreducible set - absolutely measurable set - affinely independent set - affinely invariant set - algebraically independent set - almost finite set - almost full set - angular cluster set - asymptotically indecomposable set - at most denumerable set - centro-symmetric set - completely bounded set - completely continuous set - completely generating set - completely improper set - completely irreducible set - completely nonatomic set - completely normal set - completely ordered set - completely productive set - completely reducible set - completely separable set - constructively nonrecursive set - convexly independent set - countably infinite setto set aside — не учитывать, не принимать во внимание; откладывать
- cut set- cyclically ordered set - deductively inconsistent set - derived set - doubly well-ordered set - dual set of equations - dynamically disconnected set - effectively enumerable set - effectively generating set - effectively nonrecursive set - effectively simple set - enumeration reducible set - finely perfect set - finitely definite set - finitely measurable set- flat set- full set- fully reducible set - functionally closed set - functionally complete set - functionally open set - fundamental probability set - generalized almost periodic set- goal set- internally stable set- knot set- left directed set - left normal set - left-hand cluster set - linearly ordered set - local peak set - locally arcwise set - locally closed set - locally compact set - locally connected set - locally contractible set - locally convex set - locally finite set - locally invariant set - locally negligible set - locally null set - locally polar set - locally polyhedral set - metrically bounded set - metrically dense set - multiply ordered set - nearly analytic set - nearly closed set - nonvoid set - normally ordered set- null set- open in rays set - partitioned data set- peak set- pole set- positively homothetic set- pure set- radially open set - rationally independent set - recursively creative set - recursively indecomposable set - recursively isomorphic set - recursively productive set - regularly convex set - regularly situated sets - relatively closed set - relatively compact set - relatively dense set - relatively interpretable set - relatively open set - right normal set - right-hand cluster set- scar set- sequentially complete set - serially ordered set - set of elementary events - set of first category - set of first kind - set of first species - set of possible outcomes - set of probability null - set of second category - set of second species - shift invariant set - simply connected set - simply ordered set - simply transitive set- skew set- star set- strongly bounded set - strongly closed set - strongly compact set - strongly connected set - strongly convex set - strongly dependent set - strongly disjoint sets - strongly enumerable set - strongly independent set - strongly minimal set - strongly polar set - strongly reducible set - strongly separated set - strongly simple set - strongly stratified set- tame set- tautologically complete set - tautologically consistent set - tautologically inconsistent set- test set- thin set- tie set- time set- totally disconnected set - totally imperfect set - totally ordered set - totally primitive set - totally unimodular set - totally unordered set - truth-table reducible set - uniformly bounded set - uniformly continuous set - uniformly convergent set - uniformly integrable set - uniformly universal set - unilaterally connected set- unit set- vacuous set- void set- weakly compact set - weakly convex set - weakly n-dimensional set - weakly stratified set - weakly wandering set - well chained set - well founded set - well measurable set - well ordering set - well quasiordered set -
4 complete
1) завершать
2) выполнять
3) достраивать
4) завершить
5) заканчивать
6) комплектный
7) укомплектовывать
8) полный
9) завершенный
10) законченный
11) комплектировать
12) комплектовать
13) наследственный
14) отработать
15) пополненный
16) совершенный
17) тотальный
18) необратимый
– complete an operation
– complete analysis
– complete applicability
– complete circuit
– complete closure
– complete code
– complete combustion
– complete compilation
– complete continuity
– complete control
– complete decarburization
– complete failure
– complete file
– complete fusion
– complete graph
– complete induction
– complete inflammation
– complete integral
– complete integration
– complete inversion
– complete license
– complete modulation
– complete mold
– complete normality
– complete operation
– complete ordering
– complete polygon
– complete quadrangle
– complete radiator
– complete revolutions
– complete series
– complete set
– complete similitude
– complete the square
– complete unit
– complete weld
– complete with
– functionally complete
– holomorphically complete
axiom of complete induction — аксиома математической индукции
complete regenerative cycle — предельный регенеративный цикл
equationally complete extension — эквационально полное расширение
-
5 complete
[kəm'pliːt]1) Общая лексика: глубокий, доделывать, дополнять, завершённый, завершать, завершить, заканчивать, законченный, закончить, изживать, комплектный, комплектовать, круглый (полный), непроходимый, полный, пройти (курс обучения), совершенный, сплошной, укомплектованный, укомплектовать, укомплектовывать, цельный, обустроить, восполнять, пополнять, оформлять, довести до конца, полноценный, заполнить2) Техника: весь, выполнять, кончать, осуществлять, в сборе4) Математика: (functionally) функционально-полный, без дефектов, включать, восполнить, делать полным, доделать, заключать, заключить, замыкать, исчерпывающий, кончить, наследственный, оканчивать, окончить, осуществить, отрабатывать, отработать, пополненный, пополнить, собственный, тотальный5) Юридический термин: сделать совершенным, доработать (о законопроекте)6) Экономика: в комплекте (set), заполнять (переписной лист, форму и т.п.)8) Сленг: комплит (собранное целое из частей, напр., скейтборд)9) Генетика: полная леталь10) Деловая лексика: абсолютный, целый11) Глоссарий компании Сахалин Энерджи: сделано (о документе)12) ЕБРР: оформить13) Контроль качества: в собранном виде14) Макаров: замкнутый, непополняемый, полная система, полный комплект, полный набор, абсолютный (полный), доводить (что-л.) до конца (завершать), заканчивать (что-л. завершать)15) SAP.тех. выполнить16) Нефть и газ: заканчивать строительством (AD) -
6 relation
1) зависимость, (взаимо)связь2) отношение; соотношение4) геол. условия залегания•- almost universal relation - cause-effect relation - generalized semigroup relation - logically irreducible relation - parametrically definable relation - partial ordering relation - recursively enumerable relation - recursively invariant relation - recursively representable relation - strongly definable relation - weakly symmetric relation
См. также в других словарях:
Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Instruction set — An instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception… … Wikipedia
Functional completeness — In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.[1][2] A well known complete set of… … Wikipedia
Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… … Wikipedia
Sheffer stroke — This article is about the logical NAND operator. For the electronic NAND gate, see Negated AND gate. For other uses, see Nand (disambiguation). Venn diagram of In Boolean functions and propositional calculus, the Sheffer stroke, named after … Wikipedia
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
education — /ej oo kay sheuhn/, n. 1. the act or process of imparting or acquiring general knowledge, developing the powers of reasoning and judgment, and generally of preparing oneself or others intellectually for mature life. 2. the act or process of… … Universalium
Post's lattice — In logic and universal algebra, Post s lattice denotes the lattice of all clones on a two element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941 [E. L. Post, The two valued … Wikipedia
Distributed operating system — A distributed operating system is the logical aggregation of operating system software over a collection of independent, networked, communicating, and spatially disseminated computational nodes.[1] Individual system nodes each hold a discrete… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
